Computing Polynomials with Few Multiplications
نویسنده
چکیده
It is a folklore result in arithmetic complexity that the number of multiplication gates required to compute a worst-case n-variate polynomial of degree d is at least
منابع مشابه
Sixtors and Mod 6 Computations
We consider the following phenomenon: with just one multiplication we can compute (3u+2v)(3x+2y) ≡ 3ux+4vy (mod 6), while computing the same polynomial modulo 5 needs 2 multiplications. We generalize this observation and we define some vectors, called sixtors, with remarkable zero-divisor properties. Using sixtors, we also generalize our earlier result (Computing Elementary Symmetric Polynomial...
متن کاملComputing Elementary Symmetric Polynomials with a Sublinear Number of Multiplications
Elementary symmetric polynomials S n are used as a benchmark for the boundeddepth arithmetic circuit model of computation. In this work we prove that S n modulo composite numbersm = p1p2 can be computed with much fewer multiplications than over any field, if the coefficients of monomials xi1xi2 · · ·xik are allowed to be 1 either mod p1 or mod p2 but not necessarily both. More exactly, we prove...
متن کاملComputing Elementary Symmetric Polynomials with a Sub-Polynomial Number of Multiplications Preliminary Version
Elementary symmetric polynomials S n are used as a benchmark for the boundeddepth arithmetic circuit model of computation. In this work we prove that S n modulo composite numbers m = p1p2 can be computed with much fewer multiplications than over any eld, if the coe cients of monomials xi1xi2 xik are allowed to be 1 either mod p1 or mod p2 but not necessarily both. More exactly, we prove that fo...
متن کاملThree New Systematic Approaches for Computing Heffron-Phillips Multi-Machine Model Coefficients (RESEARCH NOTE)
This paper presents three new systematic approaches for computing coefficient matrices of the Heffron-Phillips multi-machine model (K1, …, K6). The amount of computations needed for conventional and three new approaches are compared by counting number of multiplications and divisions. The advantages of new approaches are: (1) their computation burdens are less than 73 percent of that of convent...
متن کاملOn the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
We present algorithms which use only O(x/ nonscalar multiplications (i.e. multiplications involving "x" on both sides) to evaluate polynomials of degree n, and proofs that at least x/ are required. These results have practical application in the evaluation of matrix polynomials with scalar coefficients, since the "matrix matrix" multiplications are relatively expensive, and also in determining ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 18 شماره
صفحات -
تاریخ انتشار 2011